A class of pseudonoise sequences over GF(P) with low correlation zone
نویسندگان
چکیده
b = 1. The index set I must be of the form I = A [ B [ C where A = f1g B = fz + 1 j z 2 C0; z + 1 2 C0g and C = f0z j z 2 C1; z + 1 2 C1g: Observe that these three sets are pairwise-disjoint. Therefore, The other cases can be treated similarly. ACKNOWLEDGMENT The authors wish to thank the anonymous referee for careful review of the original manuscript and helpful comments. Double-check of the computer work by Existence of cyclic Hadamard difference sets and its relation to binary sequences with ideal autocorrelation, " J. A class of binary sequences with optimal autocorrelation properties, " IEEE Trans. of period 2 01 with ideal autocorrelation generated by the polynomial z + (z + 1) , " IEEE Trans.dorandom sequences of period 2 01 with ideal autocorrelation, " IEEE Extension of binary sequences with ideal autocorrelation property, " paper, preprint, 1999. [14] D. V. Sarwate, " Comments on 'A class of balanced binary sequences with optimal autocorrelation properties', " IEEE Trans. [17] V. M. Sidelnikov, " Some k-valued pseudo-random sequences and nearly equividistant codes, " Probl. Abstract—In this correspondence, a new class of pseudonoise sequences over GF (), based on Gordon–Mills–Welch (GMW) sequences, is constructed. The sequences have the property that, in a specified zone, the out-of-phase autocorrelation and cross-correlation values are all equal to 1. Such sequences with low correlation zone (LCZ) are suitable for approximately synchronized code-division multiple-access (CDMA) system.
منابع مشابه
Direct proof of polynomial complexity optimum multiuser detection algorithm - Electronics Letters
TAKATSUKASA, K.: ‘A binary sequence pair with half period zero correlation zone’. Tech. Rpt. of IEICE, March 1999, IT 98-89, pp. 31-34 FAN, P.Z., SUEHIRO, N., KUROYANAGl, N . , and DENG, X.M.: ‘A Class Of binary sequences with zero correlation zone’, Electron. Lett.. 1999, 35, pp. 111-179 4 DENG.X.M., and FAN,P.Z.: ‘Spreading sequence sets with zero correlation zone’, Electron. Lett., 2000, 36,...
متن کاملOn the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities
Klapper [1] showed that there are binary sequences of period q − 1(q is a prime power p, p is an odd prime) with the maximal possible linear complexity q−1 when considered as sequences over GF (2), while the sequences have very low linear complexities when considered as sequences over GF (p). This suggests that the binary sequences with high GF (2) linear complexities and low GF (p) linear comp...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملNew designs for signal sets with low cross correlation, balance property, and largelinear span: GF(p) case
New designs for families of sequences over GF ( ) with low cross correlation, balance property, and large linear span are presented. The key idea of the new designs is to use short -ary sequences of period with the two-level autocorrelation function together with the interleaved structure to construct a set of long sequences with the desired properties. The resulting sequences are interleaved s...
متن کاملNew construction of M -ary sequence families with low correlation from the structure of Sidelnikov sequences
The main topics of this paper are the structure of Sidelnikov sequences and new construction of M ary sequence families from the structure. For prime p and a positive integer m, it is shown that M -ary Sidelnikov sequences of period p − 1, if M | pm − 1, can be equivalently generated by the operation of elements in a finite field GF(p), including a p-ary m-sequence. The equivalent representatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001